#include<iostream>
#include<vector>
#include<unordered_map>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_set>
#include<bits/stdc++.h>
#define fi first
#define se second
#define SIZE(x) ((int)x.size())
#define out(x) cerr<<#x<<" = "<<(x)<<endl;
#define MP(a,b) make_pair(a,b)
using namespace std;
typedef long long ll;
#define VI vector<int>
#define VVI vector< vector<int> >
#define VL vector<ll>
#define VVL vector<VL >
#define VC vector<char>
#define PI pair<int,int>
#define PL pair<ll,ll>
#define EPS 0.0000001


inline int lson(int x){return x<<1;}
inline int rson(int x){return (x<<1)|1;}

inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}

template<typename T> 
inline void read(T &x){
	x=0;T f=1;char ch;
	do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');
	do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}

//#define INF 5340172838076674L
#define INF 1000000000
#define MOD 998244353

int n;
ll dat[100];
int main(){
    #ifdef BUG
    freopen("a.in","r",stdin);
    #endif
    n=read();
	memset(dat,0,sizeof dat);
	for(int j=0;j<n;j++){
		ll a;
		read(a);
		for(int i=51;i>=0;i--){
			if((a>>i)&1){
				if(dat[i])a^=dat[i];
				else {
					dat[i]=a;
					break;
				}
			}
		}
	}
	ll res=0;
	for(int i=51;i>=0;i--)if(dat[i]){
		for(int j=i-1;j>=0;j--)if((dat[i]>>j)&1){
			dat[i]^=dat[j];
		}
		res^=dat[i];
	}
	cout<<res<<endl;
}